Graph Ramsey Theory and the Polynomial Hierarchy
نویسندگان
چکیده
منابع مشابه
Induced Graph Ramsey Theory
We say that a graph F strongly arrows (G, H) and write F (G, H) if for every edge-coloring of F with colors red and blue a red G or a blue H occurs as an induced subgraph of F . Induced Ramsey numbers are defined by r(G, H) = min{|V (G)| : F (G, H)}. The value of r(G, H) is finite for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families of grap...
متن کاملGraph Parameters and Ramsey Theory
Ramsey’s Theorem tells us that there are exactly two minimal hereditary classes containing graphs with arbitrarily many vertices: the class of complete graphs and the class of edgeless graphs. In other words, Ramsey’s Theorem characterizes the graph vertex number in terms of minimal hereditary classes where this parameter is unbounded. In the present paper, we show that a similar Ramsey-type ch...
متن کاملPolynomial hierarchy graph properties in hybrid logic
In this article, we show that for each property of graphs G in the Polynomial Hierarchy (PH) there is a sequence φ1, φ2, . . . of formulas of the full hybrid logic which are satisfied exactly by the frames in G. Moreover, the size of φn is bounded by a polynomial in n. These results lead to the definition of syntactically defined fragments of hybrid logic whose model checking problem is complet...
متن کاملComplexity Theory 6 . The Polynomial Hierarchy
An oracle Turing machine M has the following additional features: – an additional tape (= query tape) – three additional states: query state q?, answer states qYES, qNO Suppose that M has an oracle for the problem A. Then the call of the oracle works as follows: If M is in state q?, then M decides if the string z on the query tape is a positive instance of A or not. ⇒ M either enters state qYES...
متن کاملOn two problems in graph Ramsey theory
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every twocoloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2000.1729